On the largest prime divisor of an odd harmonic number
نویسندگان
چکیده
A positive integer is called a (Ore’s) harmonic number if its positive divisors have integral harmonic mean. Ore conjectured that every harmonic number greater than 1 is even. If Ore’s conjecture is true, there exist no odd perfect numbers. In this paper, we prove that every odd harmonic number greater than 1 must be divisible by a prime greater than 105.
منابع مشابه
The third largest prime divisor of an odd perfect number exceeds one hundred
Let σ(n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if σ(n) = 2n. It is well known that a number is even and perfect if and only if it has the form 2p−1(2p − 1) where 2p − 1 is prime. It is unknown whether or not odd perfect numbers exist, although many conditions necessary for their existence have been found. For example, Cohen and Hagis ha...
متن کاملOn the Largest Prime Divisor of an Odd Perfect Number . II
It is proved here that every odd perfect number has a prime factor greater
متن کاملThe second largest prime divisor of an odd perfect number exceeds ten thousand
Let σ(n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if σ(n) = 2n. It is well known that a number is even and perfect if and only if it has the form 2p−1(2p − 1) where 2p − 1 is prime. No odd perfect numbers are known, nor has any proof of their nonexistence ever been given. In the meantime, much work has been done in establishing conditions ...
متن کاملOdd Harmonic Numbers Exceed 10 24 Graeme
A number n > 1 is harmonic if σ(n) | nτ(n), where τ(n) and σ(n) are the number of positive divisors of n and their sum, respectively. It is known that there are no odd harmonic numbers up to 1015. We show here that, for any odd number n > 106, τ(n) ≤ n1/3. It follows readily that if n is odd and harmonic, then n > p3a/2 for any prime power divisor pa of n, and we have used this in showing that ...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 76 شماره
صفحات -
تاریخ انتشار 2007